1750 Sanjeev Arora , Elad Hazan , And
نویسندگان
چکیده
This paper shows how to compute O( √ logn)-approximations to the Sparsest Cut and Balanced Separator problems in Õ(n2) time, thus improving upon the recent algorithm of Arora, Rao, and Vazirani [Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 222–231]. Their algorithm uses semidefinite programming and requires Õ(n9.5) time. Our algorithm relies on efficiently finding expander flows in the graph and does not solve semidefinite programs. The existence of expander flows was also established by Arora, Rao, and Vazirani [Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004, pp. 222–231].
منابع مشابه
O ( √ log n ) Approximation to Sparsest Cut in Õ ( n 2 ) Time
We show how to compute O( √ logn)-approximations to Sparsest Cut and Balanced Separator problems in Õ(n) time, thus improving upon the recent algorithm of Arora, Rao and Vazirani (2004). Their algorithm uses semidefinite programming and required Õ(n) time. Our algorithm relies on efficiently finding expander flows in the graph and does not solve semidefinite programs. The existence of expander ...
متن کاملThe Multiplicative Weights Update Method: a Meta-Algorithm and Applications
Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analysis are usually very similar and rely on an exponential potential function. We present a simple meta algorithm that unifies these disparate algorithms and drives them as simple instantiations of the meta algorithm.
متن کاملO ( √ log n ) approximation to SPARSEST CUT can be found in Õ ( n 2 ) time
We show that the recent results for obtaining O( √ log n)-approximation to sparsest cut and balanced separator problems due to Arora, Rao, and Vazirani (2004) can be used to derive an Õ(n) time approximation algorithm for an n-node graph. The previous best algorithm needed to solve a semidefinite program with O(n) constraints. Our algorithm relies on efficiently finding expander flows in the gr...
متن کاملThe Multiplicative Weights Update Method: A Meta Algorithm and its Applications
Algorithms in varied fields use the idea of maintaining a distribution over a certain set and use the multiplicative update rule to iteratively change these weights. Their analyses are usually very similar and rely on an exponential potential function. In this survey we present a simple meta algorithm that unifies these disparate algorithms and drives them as simple instantiations of the meta a...
متن کاملA Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more than the Chernoff-Hoeffding bounds. Despite the simplicity, the approximation is comparable and sometimes better than previous work. Our algorithm computes the sparse matrix approximation in a single pass over the data. ...
متن کامل